Two Bit Overlap: A Class of Double Error Correction One Step Majority Logic Decodable Codes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Class of One-Step Majority-Logic Decodable Cyclic Codes

Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2 ) the decoding delay is short; and (3) its performance, while suboptimal, is always superior to bounded distance decoding. For these reasons, majoritylogic decodable cyclic codes are very suitable f o r error control in high speed digital data transmission systems. Among the majority-logic decodable co...

متن کامل

A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes

The performance of iterative decoding algorithm for one-step majority logic decodable (OSMLD) codes is investigated. We introduce a new soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. However the computation time of the proposed algorithm is very low. The developed algorithm can also be applied to product code...

متن کامل

Double Bit Error Correction Code

single faults in a data word, they cannot correct double bit errors caused by single the single error correction and double-error detection codes to provide. Official Full-Text Publication: Double Bits Error Correction Using CRC Method on that is able to detect the exact place of double bits error and correct them. for double and single bits error correction using Cycle Redundancy Code. a Singl...

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Decoding Error - Correction Codes Utilizing Bit - Error Probability Estimates

The main purpose of this dissertation is to estimate the individual bit-error probabilities of binary symbols or codewords while they are being received. It turns out that the bit-error probabilities are a function of the received-bit amplitudes and the channel noise power, both of which are assumed to be unknown a-priori at the receiver. In this study coherent detection is implemented with a C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computers

سال: 2019

ISSN: 0018-9340,1557-9956,2326-3814

DOI: 10.1109/tc.2018.2890651